Scheme theory - PDFSEARCH.IO - Document Search Engine

Scheme theory
Results: 835

#	Item
11	Locally Random Reductions: Improvements and Applications D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995 Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2001-10-24 10:55:38 Cryptography Polynomials Probabilistic complexity theory IP Commitment scheme NP Interactive proof system Zero-knowledge proof Polynomial interpolation Polynomial Random self-reducibility Permutation polynomial
12	ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti Add to Reading List Source URL: www.crypto.ethz.ch Language: English - Date: 2015-04-20 05:14:26 Cryptography Graph theory Mathematics NP-complete problems Zero-knowledge proof Algebraic graph theory Commitment scheme Hamiltonian path problem Hamiltonian path Proof of knowledge Adjacency matrix NP
13	The Hodge-Arakelov Theory of Elliptic Curves in Positive Characteristic Shinichi Mochizuki OctoberContents: Add to Reading List Source URL: www.kurims.kyoto-u.ac.jp Language: English - Date: 2011-11-07 07:23:50 Abstract algebra Algebra Mathematics Algebraic geometry Category theory Finite fields Elliptic curves Group theory Frobenius endomorphism Supersingular elliptic curve Abelian variety Group scheme
14	609 Documenta Math. The Absolute Anabelian Geometry of Canonical Curves Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2003-12-22 16:28:43 Algebra Abstract algebra Algebraic geometry Algebraic varieties Scheme theory Vector bundles Algebraic surfaces tale morphism tale fundamental group Stack Algebraic curve Canonical bundle
15	A Commitment-Consistent Proof of a Shuﬄe Douglas Wikstr¨om CSC KTH Stockholm, Sweden Abstract. We introduce a pre-computation technique that drastically Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2012-05-30 08:52:53 Cryptography Public-key cryptography Computational complexity theory Paillier cryptosystem Proof of knowledge Commitment scheme RSA Zero-knowledge proof Permutation ElGamal encryption IP
16	A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility Add to Reading List Source URL: tandy.cs.illinois.edu Language: English - Date: 2015-04-08 19:35:45 Computational complexity theory Theory of computation Complexity classes NP-complete problems Combinatorial optimization Packing problems Approximation algorithms Knapsack problem NP APX
17	TOPICS IN ABSOLUTE ANABELIAN GEOMETRY I: GENERALITIES Shinichi Mochizuki March 2012 Abstract. This paper forms the ﬁrst part of a three-part series in which we treat Add to Reading List Source URL: www.kurims.kyoto-u.ac.jp Language: English - Date: 2012-03-13 05:32:20 Algebra Abstract algebra Mathematics Group theory Algebraic geometry Scheme theory Lie groups tale fundamental group Anabelian geometry Topological group Commutator subgroup Group
18	803 Documenta Math. Natural G-Constellation Families Timothy Logvinenko Add to Reading List Source URL: documenta.sagemath.org Language: English - Date: 2008-12-31 12:34:13 Abstract algebra Algebra Vector bundles Algebraic geometry Scheme theory Divisor Algebraic varieties Ample line bundle Sheaf Coherent sheaf Morphism of algebraic varieties Equivariant sheaf
19	Incremental Specialization of an HPSG-Based Annotation Scheme Kiril Simov, Milen Kouylekov, Alexander Simov BulTreeBank Project http://www.BulTreeBank.org Linguistic Modelling Laboratory, Bulgarian Academy of Sciences Ac Add to Reading List Source URL: bultreebank.org Language: English - Date: 2003-12-07 15:19:14 Graph theory Discrete mathematics Graph rewriting Graph Head-driven phrase structure grammar Line graph Intersection graph
20	Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡ Shaddin Dughmi§ Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-05-11 07:37:06 Computational complexity theory Mathematics Theory of computation Analysis of algorithms Scheduling Polynomial-time approximation scheme Makespan Time complexity Partition Randomized algorithm Algorithm Integral